A Fully Distributed Chess Program
نویسندگان
چکیده
We show how to implement the-enhancements like iterative deepening, transposition tables, history tables etc. used in sequential chess programs in a distributed system such that the distributed algorithm proots by these heuristics as well as the sequential does. Moreover the methods we describe are suitable for very large distributed systems. We implemented these-enhancements in the distributed chess program ZUGZWANG. For a distributed system of 64 processors we obtain a speedup between 28 and 34 running at tournament speed. The basis for this chess program is a distributed-algorithm with very good load balancing properties combined with the use of a distributed transposition table that grows with the size of the distributed system.
منابع مشابه
Analysis of Performance of Consultation Methods in Computer Chess
The performance of consultation methods, i.e., majority voting, the optimistic selection rule, and the pseudo-random number (PRN) ensemble method, are examined in computer chess using 2180 chess problems. Here, the optimistic selection rule selects a program that returns the highest search value, and the PRN ensemble consists of multiple individual copies of one base program, and each copy is d...
متن کاملDistributed Game Tree Search on a Massively Parallel System
During the World Computer Chess Championships in Madrid, November 1992, our distributed chess program ZUGZWANG ran on a 1024 processor machine and nished second place without having lost a game. This article presents measurements that show the behaviour of ZUGZWANG using massive parallelism. We will show that the network used to interconnect the processors is a crucial point for the eeciency of...
متن کاملExperiments in Distributing and Co-ordinating Knowledge
We have built a distributed chess program running over a network of workstations. The program consists of several independent “advising” processes each using different chess knowledge to evaluate the position; each evaluator offers its advice to a coordinating process, that uses a selection policy to choose the move. We have built the advisors redistributing the knowledge included in a strong s...
متن کاملAuditory memory function in expert chess players
Background: Chess is a game that involves many aspects of high level cognition such as memory, attention, focus and problem solving. Long term practice of chess can improve cognition performances and behavioral skills. Auditory memory, as a kind of memory, can be influenced by strengthening processes following long term chess playing like other behavioral skills because of common processing pat...
متن کاملFully Distributed Modeling, Analysis and Simulation of an Improved Non-Uniform Traveling Wave Structure
Modeling and simulation of communication circuits at high frequency are important challenges ahead in the design and construction of these circuits. Knowing the fact that the lumped element model is not valid at high frequency, distributed analysis is presented based on active and passive transmission lines theory. In this paper, a lossy transmission line model of traveling wave switch (TWSW) i...
متن کامل